Rectifiability of Optimal Transportation Plans
نویسندگان
چکیده
منابع مشابه
Uniqueness and Approximate Computation of Optimal Incomplete Transportation Plans∗
For α ∈ (0, 1) an α−trimming, P ∗, of a probability P is a new probability obtained by re-weighting the probability of any Borel set, B, according to a positive weight function, f ≤ 1 1−α , in the way P ∗(B) = R B f(x)P (dx). If P,Q are probability measures on Euclidean space, we consider the problem of obtaining the best L2−Wasserstein approximation between: a) a fixed probability and trimmed ...
متن کاملRobust contingency plans for transportation investment planning
A multistage decision process for transportation investment planning is described. Most transportation investment problems inherently involve multiple criteria and uncertainty. To deal with the variations arising from changes in external environments, robust contingency plans should be integrated in the planning process-not after plans are developed-to account for uncertainty. With the proposed...
متن کاملHybrid Heuristic for Multi-carrier Transportation Plans
This paper describes a hybrid heuristic approach to construct transportation plans for a singlecustomer multi-carrier scenario that arises at 3T Logistics Ltd, a UK company that provides outsourced transportation planning and management services. The problem consists on planning the delivery, using a set of carrier companies, of a set of shipments from a warehouse to different consignees across...
متن کاملOptimal Plans for Aggregation
We consider the following problem, which arises in the context of distributed Web computations. An aggregator aims to combine specific data from n sources. The aggregator contacts all sources at once. The time for each source to return its data to the aggregator is independent and identically distributed according to a known distribution. The aggregator at some point stops waiting for data and ...
متن کاملOptimal interdiction of attack plans
We present a Stackelberg game model of security in which the defender chooses a mitigation strategy that interdicts potential attack actions, and the attacker responds by computing an optimal attack plan that circumvents the deployed mitigations. First, we offer a general formulation for deterministic plan interdiction as a mixed-integer program, and use constraint generation to compute optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2012
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-2011-080-6